On Morphisms Preserving Palindromic Richness

نویسندگان

چکیده

It is known that each word of length n contains at most + 1 distinct palindromes. A finite rich a with maximal number palindromic factors. The definition richness can be naturally extended to infinite words. Sturmian words and Rote complementary symmetric sequences form two classes binary words, while episturmian coding d-interval exchange transformations give us other examples on larger alphabets. In this paper we look for morphisms the free monoid, which allow construct new from already We focus in Class Pret. This class injective alphabet satisfying particular palindromicity property: every morphism ? there exists palindrome w such ?(a)w first complete return letter a. characterize Pret preserve over alphabet. also study marked acting alphabets more letters. show Arnoux-Rauzy conjugated it preserves richness.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Palindromic Richness

In this paper, we study combinatorial and structural properties of a new class of finite and infinite words that are ‘rich’ in palindromes in the utmost sense. A characteristic property of so-called rich words is that all complete returns to any palindromic factor are themselves palindromes. These words encompass the well-known episturmian words, originally introduced by the second author toget...

متن کامل

On Morphisms Preserving Primitive Words

A word is called primitive if it cannot be expressed as the power of another word. Morphisms preserving primitive words are investigated. Similarly to the word case, each square-free morphism is a primitive morphism but the converse does not hold. A precise characterization of primitive morphisms is provided in terms of pure codes. An easily testable characterization is given for uniform morphi...

متن کامل

Palindromic sequences generated from marked morphisms

Fixed points u = φ(u) of marked and primitive morphisms φ over arbitrary alphabet are considered. We show that if u is palindromic, i.e., its language contains infinitely many palindromes, then some power of φ has a conjugate in class P. This class was introduced by Hof, Knill and Simon (1995) in order to study palindromic morphic words. Our definitions of marked and well-marked morphisms are m...

متن کامل

A note on 3iet preserving morphisms

An infinite word, which is aperiodic and codes the orbit of a transformation of the exchange of three intervals is called 3iet word. Such a word is thus a natural generalization of a sturmian word to a word over 3-letter alphabet. A morphism is said to be 3iet preserving if it maps any 3iet word to another 3iet word. It is known that the monoid of morphisms preserving sturmian words is finitely...

متن کامل

Upper set monoids and length preserving morphisms

Length preserving morphisms and inverse of substitutions are two wellstudied operations on regular languages. Their connection with varieties generated by power monoids was established independently by Reutenauer and Straubing in 1979. More recently, an ordered version of this theory was proposed by Polák and by the authors. In this paper, we present an improved version of these results and obt...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fundamenta Informaticae

سال: 2022

ISSN: ['1875-8681', '0169-2968']

DOI: https://doi.org/10.3233/fi-222102